A fast algorithm for computing large Fibonacci numbers
نویسنده
چکیده
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci number Fn. We show that the number of bit operations in the conventional product of Lucas numbers algorithm can be reduced by replacing multiplication with the square operation. 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
The Matrices of Fibonacci Numbers
In a recent paper, Kalman [3] derives many interesting properties of generalized Fibonacci numbers. In this paper, we take a different approach and derive some other interesting properties of matrices of generalized Fibonacci numbers. As an application of such properties, we construct an efficient algorithm for computing matrices of generalized Fibonacci numbers. The topic of generalized Fibona...
متن کاملComputing Fibonacci Numbers Fast using the Chinese Remainder Theorem
The purpose of this paper is to investigate the calculation of Fibonacci numbers using the Chinese Remainder Theorem (CRT). This paper begins by laying down some general conclusions that can be made about the Fibonacci sequence. It will then go into specific cases of the CRT and how to calculate Fibonacci numbers with reduced forms of the CRT equations. For each of the cases, algorithms and ana...
متن کاملFast block diagonalization of k-tridiagonal matrices
In the present paper, we give a fast algorithm for block diagonalization of k-tridiagonal matrices. The block diagonalization provides us with some useful results: e.g., another derivation of a very recent result on generalized k-Fibonacci numbers in [M.E.A. El-Mikkawy, T. Sogabe, A new family of k-Fibonacci numbers, Appl. Math. Comput. 215 (2010) 4456– 4461]; efficient (symbolic) algorithm for...
متن کاملMiddle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
A fast and simple O(logn) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a √ 5 conversion factor gives a faster Fibonacci algorithm because the speed up proposed in [5] also directly applies. A fast simple recursive algorithm for individual Lucas numbers is given that is O(logn).
متن کاملCoefficient Bounds for Analytic bi-Bazileviv{c} Functions Related to Shell-like Curves Connected with Fibonacci Numbers
In this paper, we define and investigate a new class of bi-Bazilevic functions related to shell-like curves connected with Fibonacci numbers. Furthermore, we find estimates of first two coefficients of functions belonging to this class. Also, we give the Fekete-Szegoinequality for this function class.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 75 شماره
صفحات -
تاریخ انتشار 2000